Labelled Deduction over Algebras of Truth-Values
نویسندگان
چکیده
We introduce a framework for presenting non-classical logics in a modular and uniform way as labelled natural deduction systems. The use of algebras of truth-values as the labelling algebras of our systems allows us to give generalized systems for multiple-valued logics. More specifically, our framework generalizes previous work where labels represent worlds in the underlying Kripke structure: since we can take multiple-valued logics as meaning not only finitely or infinitely manyvalued logics but also power-set logics, our framework allows us to present also logics such as modal, intuitionistic and relevance logics, thus providing a first step towards fibring these logics with many-valued ones.
منابع مشابه
Truth-values as Labels: A General Recipe for Labelled Deduction
We introduce a general recipe for presenting non-classical logics in a modular and uniform way as labelled deduction systems. Our recipe is based on a labelling mechanism where labels are general entities that are present, in one way or another, in all logics, namely truth-values. More specifically, the main idea underlying our approach is the use of algebras of truth-values, whose operators re...
متن کاملEvolving algebras and labelled deductivesystems for the semantic network
In the present paper we deal with two approaches suitable to formal treatment of semantical network based reasoning , that are Evolving Algebras (EA) and Labelled Deduc-tive Systems (LDS). The evolving algebras methodology give a tools for precise operational description of the any computational process at the desired level of abstraction, while labelled deduction systems allows to treat variou...
متن کاملModal Sequent Calculi Labelled with Truth Values: Completeness, Duality and Analyticity
Labelled sequent calculi are provided for a wide class of normal modal systems using truth values as labels. The rules for formula constructors are common to all modal systems. For each modal system, specific rules for truth values are provided that reflect the envisaged properties of the accessibility relation. Both local and global reasoning are supported. Strong completeness is proved for a ...
متن کاملA Judgmental Deconstruction of Modal Logic
The modalities and© of necessary and lax truth described by Pfenning and Davies can be seen to arise from the same pair of adjoint logical operators F and U , which pass in both directions between two judgments of differing strength. This may be generalized to a logic with many such adjunctions, across judgments subject to different substructral disciplines, allowing explanation of possibility ...
متن کاملEQ-logics with delta connective
In this paper we continue development of formal theory of a special class offuzzy logics, called EQ-logics. Unlike fuzzy logics being extensions of theMTL-logic in which the basic connective is implication, the basic connective inEQ-logics is equivalence. Therefore, a new algebra of truth values calledEQ-algebra was developed. This is a lower semilattice with top element endowed with two binary...
متن کامل